Joint Algebraic Coded Modulation and Lattice-Reduction-Aided Preequalization

Lattice-reduction-aided (LRA) preequalization for the multiple-input/ multiple-output broadcast channel has most often been considered for the uncoded case so far. However, recent advantages in the closely related field of integer-forcing equalization, where the cancellation of the multiuser interference and the channel coding are combined, create doubt to this separated point of view. In this letter, the philosophy of matching both the channel code and the complex-valued signal constellation to the same finite-field arithmetic is proposed. The consequences on the factorization task present in LRA preequalization are discussed and covered by numerical performance evaluations based on nonbinary low-density parity-check codes.